Subdimensional single-carrier modulation

ABSTRACT

A method for modulating a sequence of data symbols such that the transmit signal exhibits spectral redundancy. Null symbols are inserted in the sequence of data symbols such that a specified pattern of K data symbols and N-K null symbols is formed in every period of N symbols in the modulated sequence, N and K being positive integers and K being smaller than N.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application claims priority on the basis of the provisional application Ser. No. 60/151,680 entitled “Subdimensional Single-Carrier Modulation” filed on Aug. 31, 1999, the contents of which are herein incorporated by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates generally to methods and systems for providing spectral redundancy while modulating information to be transmitted with a single carrier signal.

2. Description of Related Art

Narrowband interference and deep spectral notches in the transmission channel of single-carrier modulation (SCM) systems are common impairments in high-speed digital transmission over twisted-pair subscriber lines, home phone-line networks, upstream transmission in CATV cable systems, and wireless communication systems. For example, these impairments can occur in Very-High Speed Digital Subscriber Line (VDSL) systems, which are currently in a definition phase. In a VDSL system, signals will be transmitted over twisted-pair subscriber lines in the frequency band from a few 100 kHz up to 20 MHz. Cable attenuation and crosstalk from other pairs in the same cable binder are the main impairments. Deep spectral notches in the channel transfer function may be caused by bridged taps. In addition, spectral notches may be intentionally introduced at the transmitter to prevent radiation from the cable into certain RF bands (such as amateur radio bands). Narrowband RF interference must be suppressed by notching the corresponding bands at the receiver. The characteristics of the narrowband impairments are often a priori unknown at the receiver and may change over time.

Adaptive decision-feedback equalization (DFE) is conventionally used to deal with these impairments. Good performance is achieved if interference levels and the depth of spectral notches are moderate, or the width of impaired spectral regions is small compared to the Nyquist bandwidth. However, if the impairments are more severe, DFE requires long feedforward and feedback filters, and system performance, as measured by the mean-square error, is generally degraded. Moreover, the coefficients of the feedback filter tend to become large and unending error propagation can occur.

This error propagation problem can be avoided by performing the feedback filtering operation together with modulo signal reductions in the transmitter, instead of the receiver. This so-called “precoding” technique allows obtaining a substantially intersymbol interference (ISI) free signal at the output of the feedforward equalizer in the receiver. Precoding also enables the use of trellis-coded modulation (TCM) or similar signal-space coding techniques on ISI channels. However, the capabilities of DFE and precoding are limited. If the impaired spectral regions are too wide, a SCM system must avoid these regions. Moreover, precoding requires sending the feedback filter coefficients from the receiver to the transmitter.

Thus, there is a need for SCM systems which can deliver practically ISI-free signals in spite of narrowband interference and deep spectral notches in the transmission channel, and which do not have the problems associated with DFE and preceding.

SUMMARY OF THE INVENTION

The present invention provides a method and a system for modulating a sequence of data symbols such that the modulated sequence has spectral redundancy. Null symbols are inserted in the sequence of data symbols such that a specified pattern of K data symbols and N-K null symbols is formed in every period of N symbols in the modulated sequence, N and K being positive integers and K being smaller than N. The positions of the K data symbols within every period of N symbols are defined by an index set.

The present invention also provides a method for processing a receive sequence. The receive sequence corresponds to a transmit signal having a specified pattern of K data symbols and N-K null symbols within every period of N symbols. N and K are positive integers and K is smaller than N. The positions of the K data symbols within every period of N symbols are defined by an index set. The receive sequence is equalized with a time-varying equalizer having K sets of coefficients. The K sets of coefficients are used periodically in accordance with the index set, to produce an equalized receive sequence substantially free of intersymbol interference.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other features, aspects and advantages of the present invention will be more fully understood when considered with respect to the following detailed description, appended claims and accompanying drawings, wherein:

FIG. 1 illustrates an exemplary complex-baseband model of a SD-SCM system.

FIG. 2A illustrates examples of maximally suppressed bands for the case N=7, K=6.

FIG. 2B illustrates examples of maximally suppressed bands for the case N=4, K=2, ψ={0,1}.

FIG. 3 illustrates the operation of a time-varying equalizer of length 10 on the received signal sequence {x_(n)} for the example N=8, K=3, ψ={0,1,3}.

FIG. 4 illustrates an embodiment of the time-varying equalizer 114 (FIG. 1).

DETAILED DESCRIPTION OF THE INVENTION

The present invention provides a method and a system for reliable communication in the presence of narrowband interference and deep spectral notches in the transmission channel. Unlike conventional methods, the method of the present invention does not have the problems associated with DFE and precoding (discussed in the Background section).

The method of the present invention is hereinafter referred to as “Subdimensional Single-Carrier Modulation” (SD-SCM) technique, and the corresponding system is hereinafter referred to as SD-SCM system.

Generally, subdimensional modulation means that signals are transmitted in a subspace of the signal space supported by a given channel. A channel with single-sided bandwidth of W hertz admits a signal space of 2W real signal dimensions per second. This maximum rate of dimensions per second can be achieved in many ways. Sending W=1/T complex symbols per second by quadrature-modulated SCM (with ideal “brick wall” pulse shaping filter) is one such example. Restricting modulation to subspaces of the supported signal space can also be accomplished in many ways. The method of the present invention provides one way of restricting the modulation to a K-dimensional subspace of the supported N-dimensional signal space. The important aspect of the present invention is to send signals with spectral support over the full bandwidth of the channel and achieve spectral redundancy by modulation constraints. Spectral redundancy can then be exploited in the receiver to recover the transmitted symbols from the spectral regions that have good transmission characteristics.

In a SD-SCM system, the transmitter inserts null symbols periodically in the sequence of data symbols. In the simplest case, one null symbol is inserted after every N−1 data symbols. In the general case, in every period of N symbols, a specified pattern of K data symbols and N-K null symbols is transmitted. The receiver includes a time-varying linear feedforward equalizer with K sets of coefficients. Each of the K sets of coefficients is periodically used to equalize the K data symbols in every N-symbol period. It will be shown that ISI-free symbol transmission can be achieved if the combined bandwidth of severely notched or disturbed spectral regions does not exceed (N-K)/N×(1/T), where 1/T denotes the Nyquist bandwidth.

The SD-SCM technique does not preclude adding a decision feedback filter in the receiver, or performing precoding in the transmitter. However, DFE or precoding are not essentially required in a SD-SCM system.

The coefficients of the time-varying feedforward equalizer can be adjusted adaptively using the least-mean-squares (LMS) algorithm. The required coordination between the transmitter and the receiver of a SD-SCM system is minimal. Blind equalization is also possible.

FIG. 1 illustrates an exemplary complex-baseband model of a SD-SCM system. The symbol response of the transmit filter and the impulse responses of the channel and the receive filter are denoted by h_(T) (t), g(t), and g_(R) (t), respectively. Generally, these functions are complex valued. The corresponding Fourier transforms are H_(T) (f), G(f), and G_(R) (f). Complex symbol transmission at modulation rate 1/T is assumed.

Referring to FIG. 1, a modulator 102 accepts information bits at its inputs and maps them to data symbols. The modulator 102 also inserts null symbols in the sequence of the data symbols such that a specified pattern of K data symbols and N-K null symbols is formed in every period of N symbols. N and K are positive integers and K is smaller than N. The positions of the K data symbols within every period of N symbols are defined by an index set ψ which is a subset of the set {0, 1, 2, . . . , N−1}:

ψ={k ₀ ,k ₁ , . . . k _(K−1);0≦k _(i) ≦N−1, k _(i) ≠k _(j) for i≠j}  (1)

It is assumed that ψ is free of subperiods; otherwise, an N-symbol period can be shortened to contain only one subperiod with correspondingly smaller values of N and K. Without loss of essential generality, one may require that k₀=0.

The symbol sequence {a_(n)=a_(iN+k)} at the output 103 of the modulator 102 is of the form ${a_{{iN} + k} = \begin{Bmatrix} {{data}\quad {symbol}} & {{{if}\quad k} \in \Psi} \\ 0 & {{{if}\quad k} \notin \Psi} \end{Bmatrix}},{i \in Z},{0 \leq k \leq {N - 1}},$

where Z denotes the set of integers.

The symbol sequence {an} is converted to an analog transmit signal by an digital-to-analog converter 104 operating at a clock times nT and a pulse shaping transmit filter 106. The transmit filter may be a raised cosine filter. The communication channel 108 generally distorts the transmitted signal and adds noise to it. For example, in the case of metallic twisted-pair cables, increasing attenuation with frequency and reflections of unused branching sections of the communication line (bridged taps) cause signal distortion. At higher frequencies, bridged taps can lead to deep notches in the spectral of the received signal. Noise may be due to near-end (NEXT) and/or far-end crosstalk (FEXT) from other cables in the same cable binder, ingress of narrowband radio interference, or disturbances from electric motors and household appliances. In FIG. 1, N(f) denotes the power spectral density of additive noise.

The SD-SCM system may also include in the transmit filter a notch filter to produce notches in spectrum of the transmitted signal at predetermined frequency bands, the notches having an aggregate bandwidth of less than or equal to ((N-K)/N)×(1/T), where 1/T is the Nyquist bandwidth. For example, in VDSL systems such notching may be necessary to prevent egress radiation from a cable into amateur-radio bands.

At the input of the receive filter 110, a continuous time (analog) signal x(t) is received. A sampler 112, i.e., an analog-to-digital converter, samples x(t) at clock times nT+τ and produces a signal sequence {x_(n)}. In this case, the time spacing between the sampled signals is equal to T. In other embodiments of the invention the received signal may be sampled at higher rates.

A time-varying equalizer 114 having K sets of coefficients operates on the T-spaced sequence {x_(n)} and produces an output sequence {y_(n)}. For every N-symbol period in {x_(n)}, the equalizer 114 outputs K equalized signals. In the absence of noise, these K signals will practically be equal to the K data symbols in the original transmit signal, i.e., y_(iN+k)≈a_(iN+k), kεψ, provided the index set ψ is chosen such that zero-ISI signals can be delivered in the presence of strongly impaired spectral regions of aggregate width of up to (N-K)/(NT) hertz. This can be achieved when the index set ψ is a “proper set”. The definition of a proper set is given in terms of the K×K matrix A_(K×K) (L, ψ) defined in Equation (18). If A_(K×K) (L, ψ) is non-singular for all possible sets L, then ψ is called a proper set.

One sufficient condition for a proper set ψ is that N is a prime number. In this case, ψ can be any K-ary subset of {0, 1, 2, . . . , N−1}.

Another sufficient condition for a proper set ψ is that the index set ψ is equal to {k_(i)=k₀+iΔ mod N, i=0,1,2, . . . , K−1}, where 0≦k₀≦N−1 and Δ is an integer such that the greatest common divisor of Δ and N is 1. In this case, the index set ψ is called “proper sequential”. A special set of this type is obtained when K is equal to N−1. The single null symbol may be inserted anywhere in an N-symbol period.

Examples of proper sets ψ with k₀=0 (=ψ₀) are:

N≧2, 1≧K<N−1, Δ=1: ψ₀={0,1,2, . . . ,K−1}

N=8, K=6, Δ=3: ψ₀={0,3,6,1,4,7}={0,1,3,4,6,7} (elements reordered)

N=11, K=8: ψ₀={0,2,3,4,5,7,8,9} (N prime).

It is noted that there exist also proper sets ψ, which do not satisfy one of the above two sufficient conditions, for example:

N=8, K=3: ψ={0,1,3}

N=10, K=7: ψ={0,1,2,4,5,7,8}.

Mathematically, usage of a pattern of K data symbols out of N symbols can be interpreted as K-dimensional subspace modulation in an N-dimensional signal-vector space. The modulation subspace can be rotated by multiplying N-dimensional signal vectors by an arbitrary N×N unitary matrix.

Any pattern that can be expressed as a rotation of a given pattern is considered equivalent to the given pattern for the purpose of the method of the present invention.

When the index set ψ is a proper set, the time-varying equalizer 114 can suppress strongly impaired spectral regions of aggregate width of up to (N-K)/(NT) hertz while delivering practically zero-ISI signals. This will be shown mathematically later.

The impaired spectral regions do not have to be in connected bands. As long as their aggregate bandwidth is less than or equal to (N-K)/(NT) hertz in the Nyquist band fε[0,1/T), the time-varying equalizer 114 can produce practically ISI-free signals. Examples illustrating zero-ISI achievement with maximally suppressed bands are shown in FIG. 2A and FIG. 2B.

FIG. 2A illustrates examples of maximally suppressed bands for the case N=7, K=6. In this case, there are 6 data symbols and a single null symbol in every period of 7 symbols. The maximum aggregate width of strongly impaired spectral regions is (N-K)/(NT)=1/7T hertz. In part (a) of FIG. 2A, the suppressed spectral region in is one sub-band of width 1/7T. In part (b) of FIG. 2A, the suppressed spectral regions are two non-contiguous regions of unequal widths, the aggregate width of which is equal to 1/7T. In part(c) of FIG. 2A, the suppressed spectral regions are three non-contiguous regions in the Nyquist band fε[0,1/T), the aggregate width of which is equal to 1/7T.

FIG. 2B illustrates examples of maximally suppressed bands for the case N=4, K=2, ψ={0,1}. In this case, there are 2 data symbols and two null symbols in every period of 4 symbols. As indicated by ψ, the data symbols are at positions 0 and 1 in every 4-symbol period. The maximum aggregate width of strongly impaired spectral regions is (N-K)/(NT)=1/2T hertz. In part (a) of FIG. 2B, the suppressed spectral region in is one band of width 1/2T. In part (b) of FIG. 2B, the suppressed spectral regions are three non-contiguous regions of unequal widths in the Nyquist band fε[0,1/T), the aggregate width of which is equal to 1/2T. In part(c) of FIG. 2B, the suppressed spectral regions are seven non-contiguous regions in the Nyquist band fε[0,1/T), the aggregate width of which is equal to 1/2T.

The following describes the operation of the time-varying equalizer 114 (FIG. 1) on the T-spaced sequence {x_(n)} with K sets of coefficients. For clarity, the description will be for a specific example. The example is the case N=8, K=3, ψ={0,1,3} (a proper set, as stated above). In one embodiment, the time-varying equalizer 114 (FIG. 1) is a finite impulse response filter of sufficient length M (generally greater than N). For example, M=10. The time-varying equalizer has M−1=9 delay elements. The time-varying equalizer operates on the T-spaced sequence {x_(n)} with K=3 sets of coefficients as follows. The symbols of the sequence {x_(n)} are shifted into the equalizer 114 one symbol at a time. Except for the current symbol, the symbols are stored in the delay elements of the equalizer. The input symbols are multiplied by the coefficients of the currently used set of coefficients. The results are combined to produce an output symbol. The equalizer has 3 sets of coefficients. Each of the 3 sets has 10 coefficients and is used periodically.

The equalizer uses the first set of coefficients, corresponding to k=0, i.e., the first element of ψ, to operate on the following 10 input symbols and outputs symbol y_(iN):

{x _((i−1)N−1) x _((i−1)N) x _(iN−7) x _(iN−6) x _(iN−5) x _(iN−4) x _(iN−3) x _(iN−2) x _(iN−1) x _(iN})

The equalizer uses the second set of coefficients, corresponding to k=1, i.e., the second element of ψ, to operate on the following 10 input symbols and outputs symbol y_(iN+1):

{x _((i−1)N) x _(iN−7) x _(iN−6) x _(iN−5) x _(iN−4) x _(iN−3) x _(iN−2) x _(iN−1) x _(iN) x _(iN+1)}

The equalizer uses the third set of coefficients, corresponding to k=3, i.e., the third element of ψ, to operate on the following 10 input symbols and outputs symbol y_(iN+3):

{x _(iN−6) x _(iN−5) x _(iN−4) x _(iN−3) x _(iN−2) x _(iN−1) x _(iN) x _(iN+1) x _(iN+2) x _(iN+3)}

FIG. 3 illustrates the operation of the time-varying equalizer on the input symbol sequence {x_(n)}. After the first set of coefficients is used to operate on the 10 input symbols with x_(iN) being the most current input symbol, a new input symbol x_(iN+1) is shifted into the equalizer. The second set of coefficients is then used to operate on the group of 10 input symbols with x_(iN+1) being the most current input symbol. Then, x_(iN+2) is shifted in, but the equalizer does not operate on this group of 10 symbols. Then, x_(iN+3) is shifted in, and the third set of coefficients is used to operate on the group of 10 symbols with x_(iN+3) being the most current input symbol. The elements in the index set ψ={0,1,3} determine at what positions in every N-symbol period of the input sequence the K sets of coefficients are used. In the above example, they are used at positions 0, 1, 3. After the third set of coefficients is used, the first set of coefficients is used again when x_((i+1)N) is shifted in as the most current input symbol. And the cycle continues.

FIG. 4 illustrates an embodiment of the time-varying equalizer 114 (FIG. 1). The K sets of M coefficients {c₀, c₁, . . . , c_(M+1)} are stored in M circular buffers 402, one circular buffer for each of the M coefficient positions of the equalizer. During every N-symbol period, the K coefficient values in every circular buffer are cyclically applied to generate K equalizer output signals. Additional control may be necessary to ensure that the sequence of obtained K equalized signals corresponds to the sequence of data symbols defined by ψ without duplication or omission of symbols.

This is just one exemplary implementation of the time-varying equalizer. Other architectures are possible.

The following discussion will show that when the index set ψ is a proper set, the time-varying equalizer 114 can suppress strongly impaired spectral regions of aggregate width of up to (N-K)/(NT) hertz while delivering practically zero-ISI signals.

The continuous-time signal at the receive-filter output is ${x\quad (t)} = {{\sum\limits_{n}^{\quad}\quad {a_{n}\quad h\quad \left( {t - {nT}} \right)}} + {v\quad {(t).}}}$

Sampling at times nT+τ yields ${{(2)\quad x_{n}} = {{x\quad \left( {{nT} + \tau} \right)} = {{\sum\limits_{n}^{\quad}\quad {h_{l}\quad a_{n - l}}} + v_{n}}}},$

where

h _(l) =h(lT+τ)=∫H(f)e ^(j2πf(lT+τ)) df;H(f)=H _(T() f)G(f)G _(R)(f),  (3)

E{{overscore (v)} _(n) v _(n+l) }=∫V(f)e ^(j2πflT) df;V(f)=N(f)|G_(R)(f)|².  (4)

Hereinafter, 1/T-periodic spectral functions are denoted with a tilde and considered in the Nyquist band fε[0,1/T), rather than [−1/2T,+1/2T). The 1/T-periodic spectral symbol response {tilde over (H)}(f) and the power spectral density of the noise {tilde over (V)}(f) are: ${{(5)\quad \overset{\sim}{H}\quad (f)} = {{\sum\limits_{l}^{\quad}\quad {h_{l}^{{- j}\quad 2\quad \pi \quad {flT}}}} = {\frac{1}{T}\quad {\sum\limits_{i}^{\quad}\quad {H\quad \left( {f + {i/T}} \right)\quad ^{j\quad 2\quad \pi \quad {({f + {i/T}})}\quad \tau}}}}}},{f \in \left\lbrack {0,{1/T}} \right\rbrack},{{(6)\quad \overset{\sim}{V}\quad (f)} = {{\sum\limits_{l}^{\quad}\quad {E\left\{ {{\overset{\_}{v}}_{n}\quad v_{n + l}} \right\} \quad ^{{- j}\quad 2\quad \pi \quad {flT}}}} = {\frac{1}{T}\quad {\sum\limits_{i}^{\quad}\quad {V\quad \left( {f + {i/T}} \right)}}}}},{f \in {\left\lbrack {0,{1/T}} \right\rbrack.}}$

The equalizer is a time-varying FIR filter operating on the T-spaced sequence {x_(n)} with K sets of coefficients {d_(l) ^((k))}, kεψ. The K symbol responses at the K equalizer outputs are: ${{(7)\quad {\forall{k \in {\Psi:s_{l}^{(k)}}}}} = {{\sum\limits_{l^{\prime}}^{\quad}\quad {d_{l^{\prime}}^{(k)}\quad h_{l - l^{\prime}}}} = {{\int_{0}^{1/T}{\overset{\sim}{H}\quad (f)\quad {\overset{\sim}{D}}^{(k)}\quad (f)\quad ^{j\quad 2\quad \pi \quad {flT}}\quad {f}}} = {\int_{0}^{1/T}{{\overset{\sim}{S}}^{(k)}\quad (f)\quad ^{j\quad 2\quad \pi \quad {flT}}\quad {f}}}}}},$

where ${{(8)\quad {\forall{k \in {\Psi \text{:}\quad {\overset{\sim}{D}}^{(k)}\quad (f)}}}} = {\sum\limits_{l}^{\quad}\quad {d_{l}^{(k)}\quad ^{{- j}\quad 2\quad \pi \quad {flT}}}}},{f \in \left\lbrack {0,{1/T}} \right)},$

${{(9)\quad {\forall{k \in {\Psi \text{:}\quad {\overset{\sim}{S}}^{(k)}\quad (f)}}}} = {{\sum\limits_{l}^{\quad}\quad {s_{l}^{(k)}\quad ^{{- j}\quad 2\quad \pi \quad {flT}}}} = {\overset{\sim}{H}\quad (f)\quad {\overset{\sim}{D}}^{(k)}\quad (f)}}},{f \in \left\lbrack {0,{1/T}} \right)},$

In the absence of noise, the K outputs of the equalizer in the i-th N-symbol period are given by ${(10)\quad {\forall{k \in {\Psi \text{:}\quad y_{{iN} + k}}}}} = {{\sum\limits_{l}^{\quad}\quad {d_{l}^{(k)}\quad x_{{iN} + k - l}}} = {\sum\limits_{{k - {l\quad {mod}\quad N}} \in K}^{\quad}\quad {s_{l}^{(k)}\quad {a_{{iN} + k - l}.}}}}$

The second summation in (10) accounts for data symbols only, i.e., null symbols are excluded.

The following discussion addresses the conditions for zero intersymbol interference (ISI) at the equalizer output. In a subdimensional SCM system with a rate of K/N, ISI-free transmission can be accomplished within a minimal one-sided bandwidth of K/NT Hz.

Available choices for spectral suppression in the Nyquist bandwidth 1/T Hz will be examined. Absence of noise is assumed.

Zero ISI requires y_(iN+k)=a_(iN+k), kεψ. From Equation (10), the time-domain conditions for zero-ISI are: $\begin{matrix} {{(11)\quad {\forall{k \in {\Psi \text{:}\quad s_{l}^{(k)}}}}} = \left\{ {\begin{matrix} \delta_{l} & {{{if}\quad \left( {k - {l\quad {mod}\quad N}} \right)} \in \Psi} \\ u_{l}^{(k)} & {{{if}\quad \left( {k - {l\quad {mod}\quad N}} \right)} \notin \Psi} \end{matrix}.} \right.} & \quad \end{matrix}$

In Equation (11), δ_(l) is the Kronecker indicator function, defined as being equal to zero for all l≠0 and equal to 1 for l=0. The values of u_(l) ^((k)) can be arbitrary.

The following shows the values of the symbol responses s_(l) ^((k)) for the example where N=4, K=3, ψ={0,1,2}. $\begin{matrix} {l:} & \ldots & {- 7} & {- 6} & {- 5} & {- 4} & {- 3} & {- 2} & {- 1} & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & \ldots \\ {s_{l}^{(0)}:} & \ldots & u & 0 & 0 & 0 & u_{- 3}^{(0)} & 0 & 0 & 1 & u_{1}^{(0)} & 0 & 0 & 0 & u & 0 & 0 & 0 & u & \ldots \\ {s_{l}^{(1)}:} & \ldots & 0 & u & 0 & 0 & 0 & u_{- 2}^{(1)} & 0 & 1 & 0 & u_{2}^{(1)} & 0 & 0 & 0 & u & 0 & 0 & 0 & \ldots \\ {s_{l}^{(2)}:} & \ldots & 0 & 0 & u & 0 & 0 & 0 & u_{- 1}^{(2)} & 1 & 0 & 0 & u_{3}^{(2)} & 0 & 0 & 0 & u & 0 & 0 & \ldots \end{matrix}$

The ambiguity of the symbol responses in the locations of the u_(l) ^((k))'s implies spectral redundancy. The nature of this redundancy will become apparent by expressing the fixed part of Equation (11), i.e., the upper part in Equation (11), in frequency-domain terms.

It is appropriate to divide the Nyquist band [0,1/T) into N subbands [l/NT,(l+1)/NT), l=0,1, . . . N−1, and denote the spectral symbol responses in these subbands of equal width 1/NT by:

∀kεψ,l=0,1, . . . N−1:S _(l) ^((k))(f)={tilde over (S)} ^((k))(f+l/NT), fε[0,1/NT).  (12)

With l=k−k′+iN, k′εψ, the fixed part of Equation (11) is written as: ${(13)\quad {\forall{k \in \Psi}}},{{k^{\prime} \in {\Psi:{\sum\limits_{i}^{\quad}\quad {s_{k - k^{\prime} + {iN}}^{(k)}\quad ^{j\quad 2\quad \pi \quad f\quad {({k - k^{\prime} + {iN}})}\quad T}}}}} = {\delta_{k - k^{\prime}}.}}$

Substitution of ${(14)\quad s_{k - k^{\prime} + {iN}}^{(k)}} = {{T\quad {\int_{0}^{1/T}{{\overset{\sim}{S}}^{(k)}\quad (f)\quad ^{j\quad 2\quad \pi \quad \hat{f}\quad {({k - k^{\prime} + {iN}})}\quad T}\quad {f}}}} = {T\quad {\sum\limits_{l = 0}^{N - 1}\quad {\int_{0}^{1/{NT}}{S^{(k)}\quad \left( f^{\prime} \right)\quad ^{j\quad 2\quad \pi \quad {({f^{\prime} + {l/{NT}}})}\quad {({k - k^{\prime} + {iN}})}\quad T}\quad {f^{\prime}}}}}}}$

into Equation (13) yields the zero-ISI conditions in the frequency-domain form: ${(15)\quad {\forall{k \in \Psi}}},{{k^{\prime} \in {\Psi \text{:}\quad {\sum\limits_{l = 0}^{N - 1}\quad {S_{l}^{(k)}\quad \left( f^{\prime} \right)\quad ^{j\quad 2\quad \pi \quad l\quad {{({k - k^{\prime}})}/N}}}}}} = {N\quad \delta_{k - k^{\prime}}}},{f^{\prime} \in {\left\lbrack {0,{1/{NT}}} \right).}}$

The trivial solutions of (15) are S_(l) ^((k))(f′)=1 for all l={0,1,2, . . . N−1}. This corresponds to the well-known Nyquist criterion {tilde over (S)}^((k))(f)={tilde over (H)}(f){tilde over (D)}^((k))(f)=1 for zero-ISI in unconstrained successions of modulation symbols (K=N). This solution is achievable with {tilde over (D)}^((k))(f)={tilde over (H)}⁻¹(f), if {tilde over (H)}(f) exhibits spectral support in the entire Nyquist band [0,1/T). If {tilde over (H)}(f) does not have full spectral support, or the equalizer has to suppress severe narrowband interference at certain frequencies, then {tilde over (S)}^((k))(f) should vanish in the affected spectral regions.

It will be shown that solutions of Equation (15) exist with S_(l) ^((k))(f′)≠0, lεL, and S_(l) ^((k))(f′)=0 (or arbitrary fixed values), l∉L, for all possible L:

L={l ₀ ,l ₁ , . . . l _(K−1):0≦l _(i) ≦N−1;l _(i) ≠l _(j) ,i≠j}.  (16)

In other words, {tilde over (S)}^((k))(f) can vanish at any combination of up to N-K frequencies in the set of frequencies {f=f′+l/NT, l=0,1,2, . . . N−1)}, for every frequency f′ε[0,1/NT). The suppression of (N-K)/NT Hz in not necessarily connected bands is illustrated in FIG. 2A and FIG. 2B by several examples (discussed above).

Let kεψ and S_(l) ^((k))(f′)=0, l∉L. Then, with α_(N)=e^(j2π/N), Equation (15) can be written as a system of K linear equations for K unknowns: ${{(17)\quad A_{K \times K}\quad \left( {L,\Psi} \right) \times \begin{bmatrix} {\alpha_{N}^{{- l_{0}}\quad k}\quad S_{l_{0}}^{(k)}\quad \left( f^{\prime} \right)} \\ {\alpha_{N}^{{- l_{1}}\quad k}\quad S_{l_{1}}^{(k)}\quad \left( f^{\prime} \right)} \\ \vdots \\ {\alpha_{N}^{{- l_{K - 1}}\quad k}\quad S_{l_{K - 1}}^{(k)}\quad \left( f^{\prime} \right)} \end{bmatrix}} = {N\begin{bmatrix} \delta_{k - k_{0}} \\ \delta_{k - k_{1}} \\ \vdots \\ \delta_{k - k_{K - 1}} \end{bmatrix}}},{{{{and}(18)}\quad A_{K \times K}\quad \left( {L,\Psi} \right)} = {\begin{bmatrix} \alpha_{N}^{{- l_{0}}\quad k_{0}} & \alpha_{N}^{{- l_{1}}\quad k_{0}} & \alpha_{N}^{{- l_{2}}\quad k_{0}} & \ldots & \alpha_{N}^{{- l_{K - 1}}\quad k_{0}} \\ \alpha_{N}^{{- l_{0}}\quad k_{1}} & \alpha_{N}^{{- l_{1}}\quad k_{1}} & \alpha_{N}^{{- l_{2}}\quad k_{1}} & \ldots & \alpha_{N}^{{- l_{K - 1}}\quad k_{1}} \\ \alpha_{N}^{{- l_{0}}\quad k_{2}} & \alpha_{N}^{{- l_{1}}\quad k_{2}} & \alpha_{N}^{{- l_{2}}\quad k_{2}} & \ldots & \alpha_{N}^{{- l_{K - 1}}\quad k_{2}} \\ \vdots & \vdots & \vdots & \vdots & \vdots \\ \alpha_{N}^{{- l_{0}}\quad k_{K - 1}} & \alpha_{N}^{{- l_{1}}\quad k_{K - 1}} & \alpha_{N}^{{- l_{2}}\quad k_{K - 1}} & \ldots & \alpha_{N}^{{- l_{K - 1}}\quad k_{K - 1}} \end{bmatrix}.}}$

The K×K matrix A_(K×K) (L, ψ) is a submatrix of the N×N transformation matrix of an N-point DFT.

For a solution of (17) to exist, A_(K×K) (L, ψ) must be non-singular, i.e. det(A_(K×K)(L, ψ))≠0. All elements of the solution vector must then be non-zero. If A_(K×K) (L, ψ) is non-singular for all possible sets L, then ψ is called a “proper set”.

Only sets L₀ with l₀=0 need to be tested, because dividing the elements in every row of A_(K×K) (L, ψ) by the first row element does not change the matrix rank. Similarly, only sets ψ₀ with k₀=0 need to be examined. Adding a non-zero integer value c modulo N to all elements of a set ψ₀ gives an equivalent set ${\Psi = {\Psi_{0} + {c\quad {mod}\quad N\quad \left( {{{denoted}\quad {as}\quad \Psi}\overset{c}{\equiv}\Psi_{0}} \right)}}},$

corresponding to a situation where the N-periods are shifted by c.

Two sufficient conditions for a proper set ψ₀ are (as stated previously):

1. ψ₀={k_(i)=iΔ mod N, i=0,1,2, . . . K−1}; gcd(Δ, N)=1. In this case, the set ψ₀ is called “proper sequential”)

2. N is a prime number.

While certain exemplary embodiments have been described in detail and shown in the accompanying drawings, it is to be understood that such embodiments are merely illustrative of and not restrictive on the broad invention. It will thus be recognized that various modifications may be made to the illustrated and other embodiments of the invention described above, without departing from the broad inventive scope thereof. It will be understood, therefore, that the invention is not limited to the particular embodiments or arrangements disclosed, but is rather intended to cover any changes, adaptations or modifications which are within the scope and spirit of the invention as defined by the appended claims. 

What is claimed is:
 1. A method for modulating a sequence of data symbols such that the modulated sequence has spectral redundancy, the method comprising the operation of: inserting null symbols in the sequence of data symbols such that a specified pattern of K data symbols and N-K null symbols is formed in every period of N symbols in the modulated sequence, N and K being positive integers and K being smaller than N, wherein positions of the K data symbols within every period of N symbols are defined by an index set.
 2. The method of claim 1 wherein K is equal to N−1.
 3. The method of claim 2 wherein a null symbol is inserted as a last symbol in every period of N symbols in the modulated sequence.
 4. The method of claim 1 wherein the specified pattern has K consecutive data symbols and N-K null symbols.
 5. The method of claim 1 wherein said specified pattern is replaced by a second pattern, the specified pattern defining a K-dimensional subspace of the N-dimensional signal space, the second pattern specifying a rotated version of said K-dimensional subspace, the rotation being obtained by transforming N-dimensional signal vectors in said K-dimensional subspace by an N×N unitary matrix.
 6. The method of claim 1 wherein the specified pattern of K data symbols and N-K null symbols in every period of N symbols in the modulated sequence does not exhibit a subperiod.
 7. The method of claim 1 wherein N is a prime number.
 8. The method of claim 1 wherein the positions of the K data symbols within every period of N symbols are defined by an index set ψ={k₀, k₁, . . . , k_(K−1)}, the index set ψ being included in the set {0, 1, 2, . . . , N−1}, and wherein the index set ψ is a proper set.
 9. The method of claim 1 wherein the index set is equal to {k_(i)=iΔmodN, i=0,1,2, . . . , K−1}, Δ being an integer, and wherein the greatest common divisor of Δ and N is
 1. 10. The method of claim 1 further comprising the operation of: filtering the modulated sequence to produce notches in spectrum of the modulated sequence at predetermined frequency bands, the notches having an aggregate bandwidth of less than or equal to ((N-K)/N)×(1/T), where 1/T is the Nyquist bandwidth.
 11. The method of claim 1 further comprising the operation of: filtering the modulated sequence using a transmit filter to produce a transmit signal; and transmitting the transmit signal over a transmission channel.
 12. The method of claim 11 wherein the transmit filter is a raised cosine filter.
 13. The method of claim 11 wherein the transmission channel has disturbances causing at least one notch in the spectrum of the transmit signal as received at a receiver.
 14. The method of claim 13 wherein an aggregate bandwidth of notches caused by disturbances in the transmission channel and of notches already existing in the spectrum of the transmit signal before transmission is less than or equal to ((N-K)/N)×(1/T), where 1/T is the Nyquist bandwidth.
 15. A method for processing a receive sequence, the receive sequence corresponding to a modulated sequence having a specified pattern of K data symbols and N-K null symbols within every period of N symbols, the positions of the K data symbols within every period of N symbols being defined by an index set, N and K being positive integers and K being smaller than N, the method comprising the operation of: equalizing the receive sequence using a time-varying equalizer having K sets of coefficients, each of the K sets of coefficients being used periodically and in accordance with the index set, to produce an equalized receive sequence.
 16. The method of claim 15 further comprising the operations of: receiving at a receive filter a receive analog signal corresponding to said modulated sequence via a communication channel; and sampling an output of the receive filter to produce the receive sequence.
 17. The method of claim 16 wherein the receive analog signal has spectral notches having an aggregate bandwidth of less than or equal to ((N-K)/N)×(1/T), where 1/T is the Nyquist bandwidth, and wherein the equalized receive sequence is substantially free of intersymbol interference.
 18. The method of claim 15 wherein the operation of equalizing comprises: swapping each of the K sets of coefficients in and out of a plurality of buffers, in accordance with the index set, to be used periodically to equalize the receive sequence, the K sets of coefficients being stored in said plurality of buffers.
 19. A system for modulating a sequence of data symbols such that the modulated sequence has spectral redundancy, the system comprising: a modulator for inserting null symbols in the sequence of data symbols such that a specified pattern of K data symbols and N-K null symbols is formed in every period of N symbols in the modulated sequence, N and K being positive integers and K being smaller than N, wherein the positions of the K data symbols within every period of N symbols are defined by an index set; and a transmit filter for filtering the modulated sequence to produce a transmit signal.
 20. The system of claim 19 wherein K is equal to N−1.
 21. The system of claim 20 wherein the modulator inserts a null symbol as a last symbol in every period of N symbols in the modulated sequence.
 22. The system of claim 19 wherein the specified pattern has K consecutive data symbols and N-K null symbols.
 23. The system of claim 19 wherein the modulator uses a second pattern instead of said specified pattern, the specified pattern defining a K-dimensional subspace of the N-dimensional signal space, the second pattern specifying a rotated version of said K-dimensional subspace, the rotation being obtained by transforming N-dimensional signal vectors in said K-dimensional subspace by an N×N unitary matrix.
 24. The system of claim 19 wherein the specified pattern of K data symbols and N-K null symbols in every period of N symbols in the modulated sequence does not exhibit a subperiod.
 25. The system of claim 19 wherein N is a prime number.
 26. The system of claim 19 wherein the positions of the K data symbols within every period of N symbols are defined by an index set ψ={k₀, k₁, . . . , k_(K−1)}, the index set ψ being included in the set {0, 1, 2, . . . , N−1}, and wherein the index set ψ is a proper set.
 27. The system of claim 19 wherein the index set is equal to {k_(i)=iΔmodN, i=0,1,2, . . . , K−1}, Δbeing an integer, and wherein the greatest common divisor of Δ and N is
 1. 28. The system of claim 19 further comprising: a notch filter for filtering the modulated sequence to produce notches in spectrum of the modulated sequence at predetermined frequency bands, the notches having an aggregate bandwidth of less than or equal to ((N-K)/N)×(1/T), where 1/T is the Nyquist bandwidth.
 29. The system of claim 19 wherein the transmit filter is coupled to a transmission channel to transmit the transmit signal.
 30. The system of claim 29 wherein the transmit filter is a raised cosine filter.
 31. The system of claim 29 wherein the transmission channel has disturbances causing at least one notch in the spectrum of the transmit signal as received at a receiver.
 32. The system of claim 31 wherein an aggregate bandwidth of notches caused by disturbances in the transmission channel and of notches already existing in the spectrum of the transmit signal before transmission is less than or equal to ((N-K)/N)×(1/T), where 1/T is the Nyquist bandwidth.
 33. A system for processing a receive sequence, the receive sequence corresponding to a modulated sequence having a specified pattern of K data symbols and N-K null symbols within every period of N symbols in the modulated sequence, positions of the K data symbols within every period of N symbols being defined by an index set, N and K being positive integers and K being smaller than N, the system comprising: a receive filter configured to receive an analog signal associated with the receive sequence; and a time-varying equalizer having K sets of coefficients for equalizing the receive sequence, each of the K sets of coefficients being used periodically and in accordance with the index set.
 34. The system of claim 33 further comprising a sampler sampling an output of the receive filter and producing the receive sequence.
 35. The system of claim 34 wherein the receive analog signal has spectral notches having an aggregate bandwidth of less than or equal to ((N-K)/N)×(1/T), where 1/T is the Nyquist bandwidth, and wherein the time-varying equalizer produces an output substantially free of intersymbol interference.
 36. The system of claim 33 wherein the K sets of coefficients are stored in a plurality of buffers, each of the K sets of coefficients being swapped in and out of said plurality of buffers, in accordance with the index set, to be used periodically to equalize the receive sequence. 